Realizability Models for Type Theories
نویسندگان
چکیده
منابع مشابه
Combinatorial realizability models of type theory
We introduce a new model construction for Martin-Löf intensional type theory, which is sound and complete for the 1-truncated version of the theory. The model formally combines, by gluing along the functor from the category of contexts to the category of groupoids, the syntactic model with a notion of realizability. As our main application, we use the model to analyse the syntactic groupoid ass...
متن کاملRealizability Models for Sequential Computation
We give an overview of some recently discovered realizability models that embody notions of sequential computation, due mainly to Abramsky, Nickau, Ong, Streicher, van Oosten and the author. Some of these models give rise to fully abstract models of PCF; others give rise to the type structure of sequentially realizable functionals, also known as the strongly stable functionals of Bucciarelli an...
متن کاملTowards Realizability Checking of Contracts Using Theories
Virtual integration techniques focus on building architectural models of systems that can be analyzed early in the design cycle to try to lower cost, reduce risk, and improve quality of complex embedded systems. Given appropriate architectural descriptions and compositional reasoning rules, these techniques can be used to prove important safety properties about the architecture prior to system ...
متن کاملRealizability of interaction models
In scenarios where a set of independent business partners engage in complex conversations, interaction models are a means to specify the allowed interaction behavior from a global perspective. Atomic interactions serve as basic building blocks and behavioral dependencies are defined between them. The notion of realizability centers around the question whether there exist a set of roles that col...
متن کاملRealizability models for a linear dependent PCF
Recently, Dal Lago and Gaboardi have proposed a type system, named d`PCF as a framework for implicit computational complexity. d`PCF is a non-standard type system for PCF programs which is relatively complete with respect to complexity properties thanks to the use of linear types inspired by Bounded linear logic and dependent types à la Dependent ML. In this work, we adapt the framework of quan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 1999
ISSN: 1571-0661
DOI: 10.1016/s1571-0661(04)00108-2